Multiphase Scalable Grid Scheduler Based on Multi-QoS Using Min-Min Heuristic
نویسندگان
چکیده
منابع مشابه
Multiphase Scalable Grid Scheduler Based on Multi-QoS Using Min-Min Heuristic
In scheduling, the main factor that affects searching speed and mapping performance is the number of resources or the size of search space. In grid computing, the scheduler performance plays an essential role in the overall performance. So, it is obvious the need for scalable scheduler that can manage the growing in resources (i.e. scalable). With the assumption that each resource has its own s...
متن کاملSkewness-Based Min-Min Max-Min Heuristic for Grid Task Scheduling
Skewness plays a very important role in task scheduling. It measures the degree of asymmetry in a data set. Moreover, the data set may be positively skewed or negatively skewed. The quartile coefficient of skewness lies in between -1 to 1. If the quartile coefficient is in between -1 to 0, then the data set is negatively skewed. Otherwise, it is positively skewed. Min-Min and Max-Min heuristic ...
متن کاملLoBa-Min-Min-SPA: Grid Resources Scheduling Algorithm Based on Load Balance Using SPA
In the grid environment, there are a large number of grid resources scheduling algorithms. According to the existing Min-Min scheduling algorithm in uneven load, and low resource utilization rate, we put forward LoBa-Min-Min algorithm, which is based on load balance. This algorithm first used Min-Min algorithm preliminary scheduling, then according to the standard of reducing Makespan, the task...
متن کاملOPT-Min-Min Scheduling Algorithm of Grid Resources
As a newly emerged distributed computing platform, the Gird aims at the implementation of resources sharing and collaborative computing on the internet. Research on grid resource scheduling algorithm is one of the core problems of grid technology, as well as an essential part of grid resource management. Resource scheduling in grid environment refers to the application of tasks scheduling algor...
متن کاملA Min-Conflict Heuristic-Based Web Service Chain Reconfiguration Approach
The state-of-art Web services composition approaches are facing more and more serious bottlenecks of effectiveness and stability with the increasing diversity and real-time requirements of applications, since new web service chain must be generated from “scratch” for each application. To break these bottlenecks, this paper presents a Min-Conflict Heuristic-Based Web Service Chain Reconfiguratio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2010
ISSN: 2158-107X,2156-5570
DOI: 10.14569/ijacsa.2010.010302